Semantic Discovery Optimization: Matching Composed Semantic Web Services at Publishing Time
نویسندگان
چکیده
This paper describes an algorithm optimizing the discovery process for composed semantic web services. The algorithm can be used to improve discovery of appropriate component services at invocation time. It performs semantic matchmaking of goals of a composed service to appropriate component services at publishing time. The semantic discovery problem at invocation time is therefore reduced to a selection problem from a list of available (already discovered) component services matching a goal of the composed
منابع مشابه
A procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملA Fast Semantic Web Services Matchmaker for OWL-S Services
Bringing semantics to Web Services description and matching remarkably improves the recall and precision ratios of Service discovery. Though there are many effective semantic based Web Services matchmakers, they have poor time efficiency for consuming time in the semantic reasoning step. To shorten service matching time, this paper presents a fast matchmaker for OWL-S services, called XServices...
متن کاملEfficient Semantic Service Discovery in Pervasive Computing Environments
Service-oriented architectures, and notably Web Services, are becoming an incontrovertible paradigm for the development of applications in pervasive computing environments, as they enable publishing and consuming heterogeneous networked software and hardware resources. Combined with Semantic Web technologies, in particular ontologies, Web services’ descriptions can be unambiguously and automati...
متن کاملSemantic Service Discovery Ontology based Indexing
A two-step indexing based method which indexes services by their ontologies is proposed for efficient and quick semantic service discovery. In first step, for a given service request, a set of candidate services are chosen from the index by matching the ontologies of the request with the keys of index. In the second step, the request is semantically matched with candidate services ranked by the...
متن کاملA New Algorithm for Semantic Web Service Matching
Considering the existing problems in Web service such as lack of semantic information and interoperability, atomic services can not cooperate with each other and be combined into composite services. In this paper, based on extended UDDI, we present a semantic annotation framework for Web service description and composition. The novel service matching algorithm not only takes into account the he...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005